Local Minimum Structures for Stochastic Constraint Satisfaction Algorithms
نویسندگان
چکیده
منابع مشابه
Stochastic Local Search for Distributed Constraint Satisfaction Problems
Nowadays, many real problems can be solved using local search strategies. These algorithms incrementally alter inconsistency value assignments to all the variables using a repair or hill climbing metaphor to move towards more and more complete solutions. Furthermore, if the problem can be modeled as a distributed problem, the advantages can be even greater. This paper presents a distributed mod...
متن کاملPreprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic local search solver. The architecture we use to implement the methods allows the extension of the expression language by user-defined operators, while still benefiting from the processing methods. Results from various domains, ...
متن کاملEfficient Algorithms for Strong Local Consistencies in Constraint Satisfaction Problems
The existing complete methods for solving Constraint Satisfaction Problems (CSPs) are usually based on a combination of exhaustive search and constraint propagation techniques for the reduction of the search space. Such propagation techniques are the local consistency algorithms. Arc Consistency (AC) and Generalized Arc Consistency (GAC) are the most widely studied local consistencies that are ...
متن کاملConstraint Weighting Local Search for Constraint Satisfaction
One of the challenges for the constraint satisfaction community has been to develop an automated approach to solving Constraint Satisfaction Problems (CSPs) rather than creating specific algorithms for specific problems. Much of this work has concentrated on the development and improvement of general purpose backtracking techniques. However, the success of relatively simple local search techniq...
متن کاملSystematic Versus Stochastic Constraint Satisfaction
This panel explores issues of systematic and stochastic control in the context of constraint satisfaction.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2001
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.16.38